The Fixed - Parameter Complexity of the LCS
نویسندگان
چکیده
The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several diierent ways in which parameters enter the problem, such as the number of sequences to be analyzed, the length of the common subsequence, and the size of the alphabet. Lower bounds on the complexity of this basic problem imply lower bounds on a number of other sequence alignment and consensus problems. At issue in the theory of parameterized complexity is whether a problem which takes input (x; k) can be solved in time f(k) n where is independent of k (termed xed-parameter tractability). It can be argued that this is the appropriate asymptotic model of feasible computability for problems for which a small range of parameter values covers important applications | a situation which certainly holds for many problems in biological sequence analysis. Our main results show that: (1) The Longest Common Subsequence (LCS) parameterized by the number of sequences to be analyzed is hard for W t] for all t. (2) The LCS problem problem, parameterized by the length of the common subsequence, belongs to W P] and is hard for W 2]. (3) The LCS problem parameterized both by the number of sequences and the length of the common subsequence, is complete for W 1]. All of the above results are obtained for unrestricted alphabet sizes. For alphabets of a xed size, problems (2) and (3) are xed-parameter tractable. We conjecture that (1) remains hard.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملVariants of Constrained Longest Common Subsequence
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet Σ, a set Cs of strings, and a function Co : Σ → N , the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that t...
متن کاملNew Fixed Point Attacks on GOST2 Block Cipher
GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...
متن کاملEconomic optimization of solar systems in uncertain economic conditions using the Monte Carlo method
Solar energy is an environmentally sustainable energy source as it is clean and inexhaustible. Solar systems are very common and cost-effective, thus, can be used for many home applications. In this paper, a new method is presented to optimize solar systems economically, regarding to energy cost fluctuations. In spite of conventional analyses, in which the inflation is considered constant, ...
متن کاملAlgorithms for the Constrained Longest Common Subsequence Problems
Given strings S1, S2, and P , the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. We present an algorithm which improves the time complexity of the problem from the previously known O(rnm) to O(rnm) where r, n, and m are the lengths of P, S1, and S2, respectively. As...
متن کامل